Operating System
Q151.
Consider the following segment table in segmentation scheme :\begin{array}{|l|l|l|} \hline \text { Segment ID } & \text { Base } & \text { Limit } \\ \hline 0 & 200 & 200 \\ \hline 1 & 5000 & 1210 \\ \hline 2 & 1527 & 498 \\ \hline 3 & 2500 & 50 \\ \hline \end{array}What happens if the logical address requested is - Segment Id 2 and offset 1000?Q152.
Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?Q153.
A processor can support a maximum memory of 4GB, where the memory is word-addressable (a word consists of two bytes). The size of the address bus of the process or is at least bits________.Q154.
Using the page table shown below, translate the physical address 25 to virtual address. The address length is 16 bits and page size is 2048 words while the size of the physical memory is four frames.\begin{array}{lcc} \text { Page } & \text { Present }(1-In , 0-Out) & \text { Frame } \\ 0 & 1 & 3 \\ 1 & 1 & 2 \\ 2 & 1 & 0 \\ 3 & 0 & - \end{array}Q156.
In a 64- bit machine, with 2 GB RAM, and 8 KB page size, how many entries will be there in the page table if its is inverted?Q158.
The operating system and the other processes are protected from being modified by an already running process becauseQ159.
Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to running state. III. A blocked process can move to running state. IV. A blocked process can move to ready state. Which of the above statements are TRUE?Q160.
Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the process